Optimal Phase Kernels
نویسنده
چکیده
| We consider the design of kernels for time-frequency distributions through the phase, rather than amplitude, response. While phase kernels do not attenuate troublesome cross-components, they can translate them in the time-frequency plane. In contrast to previous work on phase kernels that concentrated on placing the cross-components on top of the auto-components, we set up a \don't care" region and place the cross-components there. The close connections between optimal allpass kernels and optimal lowpass kernels provide new insight into signal-dependent time-frequency analysis.
منابع مشابه
OPTIMAL PHASE KERNELS FOR TIME-FREQUENCY ANALYSIS - Acoustics, Speech, and Signal Processing, 1996. ICASSP-96. Conference Proceedings., 1996 IEEE Inte
We consider the design of kernels for time-frequency distributions through the phase, rather than amplitude, response. While phase kernels do not attenuate troublesome crosscomponents, they can translate them in the time-frequency plane. In contrast to previous work on phase kernels that concentrated on placing the cross-components on top of the auto-components, we set up a “don’t care” region ...
متن کاملOptimal phase kernels for time-frequency analysis
We consider the design of kernels for time-frequency distributions through the phase, rather than amplitude, response. While phase kernels do not attenuate troublesome crosscomponents, they can translate them in the time-frequency plane. In contrast to previous work on phase kernels that concentrated on placing the cross-components on top of the auto-components, we set up a “don’t care” region ...
متن کاملCOLLOCATION METHOD FOR FREDHOLM-VOLTERRA INTEGRAL EQUATIONS WITH WEAKLY KERNELS
In this paper it is shown that the use of uniform meshes leads to optimal convergence rates provided that the analytical solutions of a particular class of Fredholm-Volterra integral equations (FVIEs) are smooth.
متن کاملPerformance Optimization and Modeling of Blocked Sparse Kernels
We present a method for automatically selecting optimal implementations of sparse matrixvector operations. Our software ‘AcCELS’ (Accelerated Compress-storage Elements for Linear Solvers) involves a setup phase that probes machine characteristics, and a run-time phase where stored characteristics are combined with a measure of the actual sparse matrix to find the optimal kernel implementation. ...
متن کاملOn Valid Optimal Assignment Kernels and Applications to Graph Classification
The success of kernel methods has initiated the design of novel positive semidefinite functions, in particular for structured data. A leading design paradigm for this is the convolution kernel, which decomposes structured objects into their parts and sums over all pairs of parts. Assignment kernels, in contrast, are obtained from an optimal bijection between parts, which can provide a more vali...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996